A Discrete-Time Lagrangian Network for Solving Constrained Quadratic Programs
نویسندگان
چکیده
A discrete-time recurrent neural network which is called the discrete-time Lagrangian network is proposed in this letter for solving convex quadratic programs. It is developed based on the classical Lagrange optimization method and solves quadratic programs without using any penalty parameter. The condition for the neural network to globally converge to the optimal solution of the quadratic program is given. Simulation results are presented to illustrate its performance.
منابع مشابه
Solving General Convex Qp Problems via an Exact Quadratic Augmented Lagrangian with Bound Constraints
Large convex quadratic programs, where constraints are of box type only, can be solved quite eeciently 1], 2], 12], 13], 16]. In this paper an exact quadratic augmented Lagrangian with bound constraints is constructed which allows one to use these methods for general constrained convex quadratic programming. This is in contrast to well known exact diierentiable penalty functions for this type o...
متن کاملConstrained Controller Design for Real-time Delay Recovery in Metro Systems
This study is concerned with the real-time delay recovery problem in metro loop lines. Metro is the backbone of public transportation system in large cities. A discrete event model for traffic system of metro loop lines is derived and presented. Two effective automatic controllers, linear quadratic regulator (LQR) and model predictive controller (MPC), are used to recover train delays. A newly-...
متن کاملFirst-order methods for constrained convex programming based on linearized augmented Lagrangian function
First-order methods have been popularly used for solving large-scale problems. However, many existing works only consider unconstrained problems or those with simple constraint. In this paper, we develop two first-order methods for constrained convex programs, for which the constraint set is represented by affine equations and smooth nonlinear inequalities. Both methods are based on the classic...
متن کاملConvergence of a Class of Stationary Iterative Methods for Saddle Point Problems
A unified convergence result is derived for an entire class of stationary iterative methods for solving equality constrained quadratic programs or saddle point problems. This class is constructed from essentially all possible splittings of the n×n submatrix residing in the (1,1)block of the (n+m)×(n+m) augmented matrix that would generate non-expansive iterations in R. The classic multiplier me...
متن کاملPath Optimization for the Resource-constrained Searcher
We formulate and solve a discrete-time path-optimization problem where a single searcher, operating in a discretized 3-dimensional airspace, looks for a moving target in a finite set of cells. The searcher is constrained by maximum limits on the consumption of several resources such as time, fuel, and risk along any path. We develop a specialized branch-and-bound algorithm for this problem that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- International journal of neural systems
دوره 10 4 شماره
صفحات -
تاریخ انتشار 2000